Kisu-math-2011-e-c-016
نویسندگان
چکیده
We proposed an algorithm for solving Hamilton-Jacobi equation associated to an optimal trajectory problem for a vehicle moving inside the pre-specified domain with the speed depending upon the direction of the motion and current position of the vehicle. The dynamics of the vehicle is defined by an ordinary differential equation, the right hand of which is given by product of control(a time dependent fuction) and a function dependent on trajectory and control. At some unspecified terminal time, the vehicle reaches the boundary of the pre-specified domain and incurs a terminal cost. We also associate the traveling cost with a type of integral to the trajectory followed by vehicle. We are interested in a numerical method for finding a trajectory that minimizes the sum of the traveling cost and terminal cost. We developed an algorithm solving the value function for general trajectory optimization problem. Our algorithm is closely related to the Tsitsiklis's Fast Marching Method and J. A. Sethian's OUM and SLF-LLL[1-4] and is a generalization of them. On the basis of these results, We applied our algorithm to the image processing such as fingerprint verification.
منابع مشابه
σ-sporadic prime ideals and superficial elements
Let $A$ be a Noetherian ring, $I$ be an ideal of $A$ and $sigma$ be a semi-prime operation, different from the identity map on the set of all ideals of $A$. Results of Essan proved that the sets of associated prime ideals of $sigma(I^n)$, which denoted by $Ass(A/sigma(I^n))$, stabilize to $A_{sigma}(I)$. We give some properties of the sets $S^{sigma}_{n}(I)=Ass(A/sigma(I^n))setminus A_{sigma}(I...
متن کاملConvexity and constructive infima
We show constructively that every quasi-convex uniformly continuous function f : C → R+ has positive infimum, where C is a convex compact subset of Rn. This implies a constructive separation theorem for convex sets.
متن کاملSuperconvergent Two-Grid Methods for Elliptic Eigenvalue Problems
Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm (Xu and Zhou in Math Comput 70(233):17–25, 2001), the two-space method (Racheva and Andreev in ComputMethods ApplMath 2:171–185, 2002), the shifted inverse powermethod (Hu and Cheng in Math Comput 80:1287–1301, 2011; Yang and Bi in S...
متن کامل$(varphi_1, varphi_2)$-variational principle
In this paper we prove that if $X $ is a Banach space, then for every lower semi-continuous bounded below function $f, $ there exists a $left(varphi_1, varphi_2right)$-convex function $g, $ with arbitrarily small norm, such that $f + g $ attains its strong minimum on $X. $ This result extends some of the well-known varitional principles as that of Ekeland [On the variational principle, J. Ma...
متن کاملDefinable choice for a class of weakly o-minimal theories
Given an o-minimal structure M with a group operation, we show that for a properly convex subset U , the theory of the expanded structure M′ = (M, U) has definable Skolem functions precisely when M′ is valuational. As a corollary, we get an elementary proof that the theory of any such M′ does not satisfy definable choice. §
متن کامل